KClist++: A Simple Algorithm for Finding k-Clique DensestSubgraphs in Large Graphs – Papersᵞ

Warning: MathJax requires JavaScript to process the mathematics on this page.
If your browser supports JavaScript, be sure it is enabled.

☆

1

KClist++: A Simple Algorithm for Finding k-Clique DensestSubgraphs in Large Graphs

http://www.vldb.org/pvldb/vol13/p1628-sun.pdf

Authors: Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio, Bintao Sun
Liked by: Maximimi
Domains: Graph mining, Graph algorithmics
Tags: VLDB2020

Uploaded by: Maximimi
Upload date: 2020-10-20 08:13:45

Comments: